Computing predecessor and successor in rounding to nearest
نویسندگان
چکیده
منابع مشابه
Computing predecessor and successor in rounding to nearest
We give simple and efficient methods to compute and/or estimate the predecessor and successor of a floating-point number using only floating-point operations in rounding to nearest. This may be used to simulate interval operations, in which case the quality in terms of the diameter of the result is significantly improved compared to existing approaches.
متن کاملInterval operations in rounding to nearest
We give a simple and efficient method to simulate interval operations using only rounding to nearest in IEEE 754. The quality in terms of the diameter of the result is significantly improved compared to existing approaches.
متن کاملReliable computing: numerical and rounding errors
The arithmetic performed in a machine involves numbers with only a finite number of digits, with the results that many calculations are performed with approximate representations of the actual numbers. In typical computer, only a relatively small subset of the real number system is used for the representation of all real numbers. This subset contains only rational numbers, both positive and neg...
متن کاملAccurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the rounded-to-nearest result of s := ∑ pi for a given vector of floatingpoint numbers pi, as well as algorithms for directed rounding. A special algorithm for computing the sign of s is given, also working for huge dimensions...
متن کاملAccurate solution of dense linear systems, part I: Algorithms in rounding to nearest
We investigate how extra-precise accumulation of dot products can be used to solve illconditioned linear systems accurately. For a given p-bit working precision, extra-precise evaluation of a dot product means that the products and summation are executed in 2pbit precision, and that the final result is rounded into the p-bit working precision. Denote by u = 2−p the relative rounding error unit ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BIT Numerical Mathematics
سال: 2009
ISSN: 0006-3835,1572-9125
DOI: 10.1007/s10543-009-0218-z